The Folded Hypercube ATM Switches
نویسندگان
چکیده
Over the past few years, many high performance asynchronous transfer mode (ATM) switches have been proposed. The majority of these switches have high performance but also high hardware complexity. Therefore, there is a need for switch designs with low complexity and high performance. This research proposes three new ATM switches based on the folded hypercube network (FHC). The performance of the three architectures are studied using a network model and simulation. The major performance parameters measured are the cell loss rate and cell delay time through the switch under uniform, normal, and bursty traffic patterns. To guarantee faster switching of time-sensitive cells, the routing algorithm of the three switches uses a priority scheme that gives higher precedence to the time-sensitive cells. Also, an output buffer controller is designed to manage the buffers in a fair manner. The three proposed switch architectures have lower complexity while providing equivalent or better switching performance compared to other more complex ATM switches described in the literature. This research shows a new approach to designing ATM switches by using the FHC as the switching fabric for the first time instead of using the crossbar, multi-path, or Banyan-based switching fabrics.
منابع مشابه
Modeling the Folded Hypercube Network with Opnet
Over the past few years, many high performance ATM switches have been proposed. The majority of these switches have high performances but also have very high hardware complexities. Therefore, there is a need for switch designs with lower complexity and high performance. The authors are considering using the folded hypercube (FHC) as a new infrastructure for ATM switches. Before the FHC is modif...
متن کاملHamiltonian-Connectivity and Related Property on Folded Hypercubes
In this paper, we analysis a hypercube-like structure, called the Folded Hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd. We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n =...
متن کاملHamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd.We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n = 1...
متن کامل1-vertex-fault-tolerant Cycles Embedding on Folded Hypercubes
In this paper, we focus on a hypercube-like structure, the folded hypercube, which is basically a standard hypercube with some extra links between its nodes. Let f be a faulty vertex in an n-dimensional folded hypercube FQn. We show that FQn−{f } contains a faultfree cycle of every even length from 4 to 2n−2 if n ≥ 3 and, furthermore, every odd length from n+ 1 to 2n − 1 if n ≥ 2 and n is even....
متن کاملCycle Embedding in Folded Hypercubes with More Faulty Elements
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc. Folded hypercube is a well-known variation of the hypercube structure and can be constructed from a hypercube by adding a link to every pair of nodes with complementary addresses. Let FFv (respectively, FFe) be the set of faulty nodes (respectively, faulty links) in an n-dimensional folded hype...
متن کامل